Representing Hamilton

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trinity Hamilton

The metalloenzyme nitrogenase is utilized by microbial diazotrophs to accomplish the majority of biological nitrogen fixation. Many different forms of the enzyme nitrogenase are known to exist. They are categorized by the type of metal cluster providing the N2-binding site, which is also the active site of the enzyme. The nitrogenase best-characterized to date has an active site with the compos...

متن کامل

M-alternating Hamilton paths and M-alternating Hamilton cycles

We study M-alternating Hamilton paths, and M-alternating Hamilton cycles in a simple connected graph G on ν vertices with a perfect matchingM . Let G be a bipartite graph, we prove that if for any two vertices x and y in different parts of G, d(x)+d(y) ≥ ν/2+2, then G has an M-alternating Hamilton cycle. For general graphs, a condition for the existence of an M-alternating Hamilton path startin...

متن کامل

Packing Hamilton Cycles Online

It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge disjoint Hamilton cycles, [4], [13], [9]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ≥ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to color the edges online with σ color...

متن کامل

Hamilton-Pontryagin variational integrators

In this paper we discuss the applications of the Hamilton-Pontryagin variational principle for designing time-adaptive variational integrators. First, we review the multisymplectic formalism of field theories. Next, we review the Hamilton-Pontryagin principle and show how it can be used to handle time reparametrizations in a very natural way. Finally, we derive a time-adaptive variational integ...

متن کامل

Edge Disjoint Hamilton Cycles

In the late 70s, it was shown by Komlós and Szemerédi ([7]) that for p = lnn+ln lnn+c n , the limit probability for G(n, p) to contain a Hamilton cycle equals the limit probability for G(n, p) to have minimum degree at least 2. A few years later, Ajtai, Komlós and Szemerédi ([1]) have shown a hitting time version of this in the G(n,m) model. Say a graph G has property H if it contains bδ(G)/2c ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Representation

سال: 2017

ISSN: 0034-4893,1749-4001

DOI: 10.1080/00344893.2017.1346878